Tractability and Intractability of Parameterized Counting Problems
نویسنده
چکیده
I want to thank my supervisor, Martin Grohe, for his patience, many illuminative discussions and for encouraging me to develop questions of my own. I would like to thank Dzifa Ametowobla for supporting me throughout this work especially by reading several parts of it and helping me greatly with the design. Furthermore, I am indebted to Bettina Hepp and Kay Thurley for helpful comments on earlier versions of this thesis.
منابع مشابه
Fixed-Parameter Tractability, Definability, and Model-Checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order logic as generic parameterized problems and show how this approach can be useful in studying both fixed-parameter tractability and intractability. For exampl...
متن کاملReflections on Multivariate Algorithmics and Problem Parameterization
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops into the field of multivariate algorithmics. Correspondingly, we describe how to perform a systematic investigation and exploitation of the “parameter space” of computationally hard problems. Algorithms and Complexity;...
متن کاملKernelizations for Parameterized Counting Problems
Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems, to wit, counting kernelizations which turn out to be equivalent to the fixed parameter tractability of counting problems. Furthermore, we study the application of well-known kernelization techniques to counting problems. Among ...
متن کاملOn the Fixed-Parameter Intractability and Tractability of Multiple-Interval Graph Problems
Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more then one interval associated with it. Many applications of interval graphs also generalize to multiple-interval graphs, often allowing for better robustness in the modeling of the specific application. In this paper, we study the fixed-parameter tractability and intractability of three class...
متن کاملEfficient algorithms for counting parameterized list H-colorings
We study the fixed parameter tractability of the counting version of a parameterization of the restrictive list H-coloring problem. The parameterization is defined by fixing the number of preimages of a subset C of the vertices in H through a weight assignment K on C. We show the fixed parameter tractability of counting the number of list (H,C,K)-colorings, for the case in which (H,C,K) is simp...
متن کامل